The Receptive Distributed pi-Calculus (Extended Abstract)

Adding recursion to Dpi ( Extended abstract ) Samuel Hym

Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dp...

Explicit Fusions: Theory and Implementation

This work describes a concurrent, distributed abstract machine for the pi calculus. Its primary audience are researchers in the field of concurrency. The secondary audience are working programmers looking for a better way to write interactive programs. This audience need only read Chapters 1 (an overview) and 5 (the implementation). I hope that these chapters might prove appealing to students w...

The Receptive Distributed -Calculus

In this paper we study an asynchronous distributed -calculus, with constructs for localities and migration. We show that a simple static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees a local deadlock-freedom property, that we call message deliverability. This property states that any migrating message will nd an appropriate receiver a...

Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract)

A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)

Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or co...